Threshold dominating cliques in random graphs and interval routing
نویسنده
چکیده
The existence of (shortest-path) interval routing schemes for random graphs that use at most one interval label per edge is an open problem posed in [8]. In this paper, we show that for any random graph G(n, p) with edge probability p > 0.765, there exists an interval routing scheme that uses at most one label per edge and has an additive stretch 1. In doing so, we provide an interesting construction of such an interval routing scheme for graphs that have a 12 -threshold dominating clique, and establish a general result on the existence of threshold dominating cliques in random graphs.
منابع مشابه
An Improved Interval Routing Scheme for Almost All Networks Based on Dominating Cliques
Motivated by the peer-to-peer content sharing systems in large-scale networks, we will study interval routing schemes in ErdösRényi random graphs. C. Gavoille and D. Peleg [13] posed an open question of whether almost all networks support a shortest-path interval routing scheme with 1 interval. In this paper, we answer this question partially by proving that in almost all networks, there is an ...
متن کاملOn Emergence of Dominating Cliques in Random Graphs
Emergence of dominating cliques in Erdös-Rényi random graph model G(n, p) is investigated in this paper. It is shown this phenomenon possesses a phase transition. Namely, we have argued that, given a constant probability p, an n-node random graph G from G(n, p) and for r = c log 1/p n with 1 ≤ c ≤ 2, it holds: (1) if p > 1/2 then an r-node clique is dominating in G almost surely and, (2) if p ≤...
متن کاملr-Dominating cliques in graphs with hypertree structure
Let G = (V, E) be an undirected graph and r be a vertex weight function with positive integer values. A subset (clique) D ~_ V is an r-dominat ing set (clique) in G ifffor every vertex v e V there is a vertex u e D with dist(u, v) <~ r(v). This paper contains the following results: (i) We give a simple necessary and sufficient condition for the existence of r-dominating cliques in the case of H...
متن کاملInterval Routing Schemes for Circular-Arc Graphs
Interval routing is a space efficient method to realize a distributed routing function. In this paper we show that every circular-arc graph allows a shortest path strict 2-interval routing scheme, i.e., by introducing a global order on the vertices and assigning at most two (strict) intervals in this order to the ends of every edge allows to depict a routing function that implies exclusively sh...
متن کاملStrength of strongest dominating sets in fuzzy graphs
A set S of vertices in a graph G=(V,E) is a dominating set ofG if every vertex of V-S is adjacent to some vertex of S.For an integer k≥1, a set S of vertices is a k-step dominating set if any vertex of $G$ is at distance k from somevertex of S. In this paper, using membership values of vertices and edges in fuzzy graphs, we introduce the concepts of strength of strongestdominating set as well a...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- J. Discrete Algorithms
دوره 7 شماره
صفحات -
تاریخ انتشار 2009